On the fly configuration of a processing circuit

ABSTRACT

A method for on-the fly updating of a processing circuit, the method includes monitoring, by multiple coroutines and during a monitoring period, a progress of multiple suspend-update-resume sequences executed by the processing circuit, wherein at least some of the multiple execute and suspend-update-resume sequences partially overlap and are not mutually synchronized, and wherein each suspend-update-resume sequence comprises on-the-fly updates; and determining, by a merged coroutine, timings of the multiple suspend-update-resume sequences, wherein the determining comprises performing multiple calculation iterations, wherein a calculation iteration of the multiple calculation iterations comprises calculating, in a an iterative manner, a timing of a next suspend-update-resume sequence to be executed out of the multiple suspend-update-resume sequences, and wherein the calculating is responsive to timing offsets between different suspend-update-resume sequences.

PRIORITY

This application claims the benefit of priority to U.S. Provisional Patent Application Ser. No. 63/190,411, filed May 19, 2021, which is incorporated by reference herein in its entirety.

BACKGROUND

Advanced driver assistance systems (ADAS), and autonomous vehicle (AV) systems use cameras and other sensors together with object classifiers, which are designed to detect specific objects in an environment of a vehicle navigating a road. Object classifiers are designed to detect predefined objects and are used within ADAS and AV systems to control the vehicle or alert a driver based on the type of object that is detected its location, etc.

As ADAS and AV systems progress towards fully autonomous operation, it would be beneficial to protect data generated by these systems.

SUMMARY

The following detailed description refers to the accompanying drawings. Wherever possible, the same reference numbers are used in the drawings and the following description to refer to the same or similar parts. While several illustrative embodiments are described herein, modifications, adaptations and other implementations are possible. For example, substitutions, additions, or modifications may be made to the components illustrated in the drawings, and the illustrative methods described herein may be modified by substituting, reordering, removing, or adding steps to the disclosed methods. Accordingly, the following detailed description is not limited to the disclosed embodiments and examples.

Disclosed embodiments provide systems and methods that can be used as part of or in combination with autonomous navigation/driving and/or driver assist technology features. Driver assist technology refers to any suitable technology to assist drivers in the navigation and/or control of their vehicles, such as forward collision warning (FCW), lane departure warning (LDW) and traffic sign recognition (TSR), as opposed to fully autonomous driving. In various embodiments, the system may include one, two, or more cameras mountable in a vehicle and an associated processor that monitor the environment of the vehicle. In further embodiments, additional types of sensors can be mounted in the vehicle ad can be used in the autonomous navigation and/or driver assist system. In some examples of the presently disclosed subject matter, the system may provide techniques for processing images of an environment ahead of a vehicle navigating a road for training neural networks or deep learning algorithms to estimate a future path of a vehicle based on images. In yet further examples of the presently disclosed subject matter, the system may provide techniques for processing images of an environment ahead of a vehicle navigating a road using a trained neural network to estimate a future path of the vehicle.

There are provided systems and methods, as illustrated in the claims and the specification.

Any combination of any subject matter of any claim may be provided.

Any combination of any method and/or method step disclosed in any figure and/or in the specification may be provided.

Any combination of any unit, device, and/or component disclosed in any figure and/or in the specification may be provided. Non-limiting examples of such units include a gather unit, an image processor and the like.

BRIEF DESCRIPTION OF THE DRAWINGS

The subject matter regarded as the invention is particularly pointed out and distinctly claimed in the concluding portion of the specification. The invention, however, both as to organization and method of operation, together with objects, features, and advantages thereof, may best be understood by reference to the following detailed description when read with the accompanying drawings in which:

FIG. 1 is a block diagram representation of a system consistent with the disclosed embodiments;

FIG. 2A is a diagrammatic side view representation of an exemplary vehicle including a system consistent with the disclosed embodiments;

FIG. 2B is a diagrammatic top view representation of the vehicle and system shown in FIG. 2A consistent with the disclosed embodiments;

FIG. 2C is a diagrammatic top view representation of another embodiment of a vehicle including a system consistent with the disclosed embodiments;

FIG. 2D is a diagrammatic top view representation of yet another embodiment of a vehicle including a system consistent with the disclosed embodiments;

FIG. 2E is a diagrammatic representation of exemplary vehicle control systems consistent with the disclosed embodiments;

FIG. 3 is a diagrammatic representation of an interior of a vehicle including a rearview mirror and a user interface for a vehicle imaging system consistent with the disclosed embodiments;

FIG. 4 illustrates an example of a method;

FIG. 5 illustrates an example of a timing diagram;

FIG. 6 illustrates an example of a timing diagram;

FIG. 7 illustrates an example of a pseudo-code that includes subroutines and a merge subroutine;

FIG. 8 illustrates an example of a pseudo-code of a merge subroutine;

FIG. 9 is an example of a four dimensional array and memory entries that stores parts of the four dimensional array;

FIG. 10 is an example of a method; and

FIG. 11 illustrates an example of a pseudo-code for scanning a five dimensional array.

DETAILED DESCRIPTION

In the following detailed description, numerous specific details are set forth in order to provide a thorough understanding of the invention. However, it will be understood by those skilled in the art that the present invention may be practiced without these specific details. In other instances, well-known methods, procedures, and components have not been described in detail so as not to obscure the present invention.

The subject matter regarded as the invention is particularly pointed out and distinctly claimed in the concluding portion of the specification. The invention, however, both as to organization and method of operation, together with objects, features, and advantages thereof, may best be understood by reference to the following detailed description when read with the accompanying drawings.

It will be appreciated that for simplicity and clarity of illustration, elements shown in the figures have not necessarily been drawn to scale. For example, the dimensions of some of the elements may be exaggerated relative to other elements for clarity. Further, where considered appropriate, reference numerals may be repeated among the figures to indicate corresponding or analogous elements.

Because the illustrated embodiments of the present invention may for the most part, be implemented using electronic components and circuits known to those skilled in the art, details will not be explained in any greater extent than that considered necessary as illustrated above, for the understanding and appreciation of the underlying concepts of the present invention and in order not to obfuscate or distract from the teachings of the present invention.

Any reference in the specification to a method should be applied mutatis mutandis to a system capable of executing the method and should be applied mutatis mutandis to a non-transitory computer readable medium that stores instructions that once executed by a computer result in the execution of the method.

Any reference in the specification to a system and any other component should be applied mutatis mutandis to a method that may be executed by the memory device and should be applied mutatis mutandis to a non-transitory computer readable medium that stores instructions that may be executed by the memory device.

Any reference in the specification to a non-transitory computer readable medium should be applied mutatis mutandis to a system capable of executing the instructions stored in the non-transitory computer readable medium and should be applied mutatis mutandis to method that may be executed by a computer that reads the instructions stored in the non-transitory computer readable medium.

Any combination of any module or unit listed in any of the figures, any part of the specification and/or any claims may be provided. Especially any combination of any claimed feature may be provided.

A pixel may be a picture element obtained by a camera, or may be a processed picture element.

Before discussing in detail examples of features of the processing images of an environment ahead of a vehicle navigating a road for training a neural networks or deep learning algorithms to estimate a future path of a vehicle based on images or feature of the processing of images of an environment ahead of a vehicle navigating a road using a trained neural network to estimate a future path of the vehicle, there is provided a description of various possible implementations and configurations of a vehicle mountable system that can be used for carrying out and implementing the methods according to examples of the presently disclosed subject matter. In some embodiments, various examples of the system can be mounted in a vehicle, and can be operated while the vehicle is in motion. In some embodiments, the system can implement the methods according to examples of the presently disclosed subject matter.

However, it would be appreciated that embodiments of the present disclosure are not limited to scenarios where a suspected upright object indication is caused by a high-grade road. The suspected upright object indication can be associated with various other circumstances, and can result from other types of image data and also from data that is not image based or is not exclusively image based, as well.

FIG. 1, to which reference is now made, is a block diagram representation of a system consistent with the disclosed embodiments. System 100 can include various components depending on the requirements of a particular implementation. In some examples, system 100 can include a processing unit 110, an image acquisition unit 120 and one or more memory units 140, 150. Processing unit 110 can include one or more processing devices. In some embodiments, processing unit 110 can include an application processor 180, an image processor 190, or any other suitable processing device. Similarly, image acquisition unit 120 can include any number of image acquisition unit s and components depending on the requirements of a particular application. In some embodiments, image acquisition unit 120 can include one or more image capture devices (e.g., cameras), such as image capture device 122, image capture device 124, and image capture device 126. In some embodiments, system 100 can also include a data interface 128 communicatively connecting processing unit 110 to image acquisition unit 120. For example, data interface 128 can include any wired and/or wireless link or links for transmitting image data acquired by image acquisition unit 120 to processing unit 110.

Both application processor 180 and image processor 190 can include various types of processing devices. For example, either or both of application processor 180 and image processor 190 can include one or more microprocessors, preprocessors (such as image preprocessors), graphics processors, central processing units (CPUs), support circuits, digital signal processors, integrated circuits, memory, or any other types of devices suitable for running applications and for image processing and analysis. In some embodiments, application processor 180 and/or image processor 190 can include any type of single or multi-core processor, mobile device microcontroller, central processing unit, etc. Various processing devices can be used, including, for example, processors available from manufacturers such as Intel®, AMD®, etc. and can include various architectures (e.g., x86 processor, ARM®, etc.).

In some embodiments, application processor 180 and/or image processor 190 can include any of the EyeQ series of processor chips available from Mobileye®. These processor designs each include multiple processing units with local memory and instruction sets. Such processors may include video inputs for receiving image data from multiple image sensors and may also include video out capabilities. In one example, the EyeQ2® uses 90 nm-micron technology operating at 332 Mhz. The EyeQ2® architecture has two floating point, hyper-thread 32-bit RISC CPUs (MIPS32® 34K® cores), five Vision Computing Engines (VCE), three Vector Microcode Processors (VMP®), Denali 64-bit Mobile DDR Controller, 128-bit internal Sonics Interconnect, dual 16-bit Video input and 18-bit Video output controllers, 16 channels DMA and several peripherals. The MIPS34K CPU manages the five VCEs, three VMP® and the DMA, the second MIPS34K CPU and the multi-channel DMA as well as the other peripherals. The five VCEs, three VMP® and the MIPS34K CPU can perform intensive vision computations required by multi-function bundle applications. In another example, the EyeQ3®, which is a third-generation processor and is six times more powerful that the EyeQ2®, may be used in the disclosed examples. In yet another example, the EyeQ4®, the fourth-generation processor, may be used in the disclosed examples. It is understood that other similar versions or later-developed versions may be used.

While FIG. 1 depicts two separate processing devices included in processing unit 110, more or fewer processing devices can be used. For example, in some examples, a single processing device may be used to accomplish the tasks of application processor 180 and image processor 190. In other embodiments, these tasks can be performed by more than two processing devices.

Processing unit 110 can include various types of devices. For example, processing unit 110 may include various devices, such as a controller, an image preprocessor, a central processing unit (CPU), support circuits, digital signal processors, integrated circuits, memory, or any other types of devices for image processing and analysis. The image preprocessor can include a video processor for capturing, digitizing, and processing the imagery from the image sensors. The CPU can include any number of microcontrollers or microprocessors. The support circuits can be any number of circuits generally well known in the art, including cache, power supply, clock, and input-output circuits. The memory can store software that, when executed by the processor, controls the operation of the system. The memory can include databases and image processing software, including a trained system, such as a neural network, for example. The memory can include any number of random access memories, read only memories, flash memories, disk drives, optical storage, removable storage, and other types of storage. In one instance, the memory can be separate from the processing unit 110. In another instance, the memory can be integrated into the processing unit 110.

Each memory 140, 150 can include software instructions that when executed by a processor (e.g., application processor 180 and/or image processor 190), can control operation of various aspects of system 100. These memory units can include various databases and image processing software. The memory units can include random access memory, read only memory, flash memory, disk drives, optical storage, tape storage, removable storage, and/or any other types of storage. In some examples, memory units 140, 150 can be separate from the application processor 180 and/or image processor 190. In other embodiments, these memory units can be integrated into application processor 180 and/or image processor 190.

In some embodiments, the system can include a position sensor 130. The position sensor 130 can include any type of device suitable for determining a location associated with at least one component of system 100. In some embodiments, position sensor 130 can include a GPS receiver. Such receivers can determine a user position and velocity by processing signals broadcasted by global positioning system satellites. Position information from position sensor 130 can be made available to application processor 180 and/or image processor 190.

In some embodiments, the system 100 can be operatively connectible to various systems, devices and units onboard a vehicle in which the system 100 can be mounted, and through any suitable interfaces (e.g., a communication bus) the system 100 can communicate with the vehicle's systems. Examples of vehicle systems with which the system 100 can cooperate include: a throttling system, a braking system, and a steering system.

In some embodiments, the system 100 can include a user interface 170. User interface 170 can include any device suitable for providing information to or for receiving inputs from one or more users of system 100, including, for example, a touchscreen, microphone, keyboard, pointer devices, track wheels, cameras, knobs, buttons, etc. Information can be provided by the system 100, through the user interface 170, to the user.

In some embodiments, the system 100 can include a map database 160. The map database 160 can include any type of database for storing digital map data. In some examples, map database 160 can include data relating to a position, in a reference coordinate system, of various items, including roads, water features, geographic features, points of interest, etc. Map database 160 can store not only the locations of such items, but also descriptors relating to those items, including, for example, names associated with any of the stored features and other information about them. For example, locations and types of known obstacles can be included in the database, information about a topography of a road or a grade of certain points along a road, etc. In some embodiments, map database 160 can be physically located with other components of system 100. Alternatively or additionally, map database 160 or a portion thereof can be located remotely with respect to other components of system 100 (e.g., processing unit 110). In such embodiments, information from map database 160 can be downloaded over a wired or wireless data connection to a network (e.g., over a cellular network and/or the Internet, etc.).

Image capture devices 122, 124, and 126 can each include any type of device suitable for capturing at least one image from an environment. Moreover, any number of image capture devices can be used to acquire images for input to the image processor. Some examples of the presently disclosed subject matter can include or can be implemented with only a single-image capture device, while other examples can include or can be implemented with two, three, or even four or more image capture devices. Image capture devices 122, 124, and 126 will be further described with reference to FIGS. 2B-2D, below.

It would be appreciated that the system 100 can include or can be operatively associated with other types of sensors, including for example: an acoustic sensor, a RF sensor (e.g., radar transceiver), a LIDAR sensor. Such sensors can be used independently of or in cooperation with the image acquisition unit 120. For example, the data from the radar system (not shown) can be used for validating the processed information that is received from processing images acquired by the image acquisition unit 120, e.g., to filter certain false positives resulting from processing images acquired by the image acquisition unit 120, or it can be combined with or otherwise compliment the image data from the image acquisition unit 120, or some processed variation or derivative of the image data from the image acquisition unit 120.

System 100, or various components thereof, can be incorporated into various different platforms. In some embodiments, system 100 may be included on a vehicle 200, as shown in FIG. 2A. For example, vehicle 200 can be equipped with a processing unit 110 and any of the other components of system 100, as described above relative to FIG. 1. While in some embodiments vehicle 200 can be equipped with only a single-image capture device (e.g., camera), in other embodiments, such as those discussed in connection with FIGS. 2B-2E, multiple image capture devices can be used. For example, either of image capture devices 122 and 124 of vehicle 200, as shown in FIG. 2A, can be part of an ADAS (Advanced Driver Assistance Systems) imaging set.

The image capture devices included on vehicle 200 as part of the image acquisition unit 120 can be positioned at any suitable location. In some embodiments, as shown in FIGS. 2A-2E and 3, image capture device 122 can be located in the vicinity of the rearview mirror. This position may provide a line of sight similar to that of the driver of vehicle 200, which can aid in determining what is and is not visible to the driver.

Other locations for the image capture devices of image acquisition unit 120 can also be used. For example, image capture device 124 can be located on or in a bumper of vehicle 200. Such a location can be especially suitable for image capture devices having a wide field of view. The line of sight of bumper-located image capture devices can be different from that of the driver. The image capture devices (e.g., image capture devices 122, 124, and 126) can also be located in other locations. For example, the image capture devices may be located on or in one or both of the side mirrors of vehicle 200, on the roof of vehicle 200, on the hood of vehicle 200, on the trunk of vehicle 200, on the sides of vehicle 200, mounted on, positioned behind, or positioned in front of any of the windows of vehicle 200, and mounted in or near light figures on the front and/or back of vehicle 200, etc. The image capture unit 120, or an image capture device that is one of a plurality of image capture devices that are used in an image capture unit 120, can have a field-of-view (FOV) that is different than the FOV of a driver of a vehicle, and not always see the same objects. In one example, the FOV of the image acquisition unit 120 can extend beyond the FOV of a typical driver and can thus image objects which are outside the FOV of the driver. In yet another example, the FOV of the image acquisition unit 120 is some portion of the FOV of the driver. In some embodiments, the FOV of the image acquisition unit 120 corresponding to a sector which covers an area of a road ahead of a vehicle and possibly also surroundings of the road.

In addition to image capture devices, vehicle 200 can be include various other components of system 100. For example, processing unit 110 may be included on vehicle 200 either integrated with or separate from an engine control unit (ECU) of the vehicle. Vehicle 200 may also be equipped with a position sensor 130, such as a GPS receiver and may also include a map database 160 and memory units 140 and 150.

FIG. 2A is a diagrammatic side view representation of a vehicle imaging system according to examples of the presently disclosed subject matter. FIG. 2B is a diagrammatic top view illustration of the example shown in FIG. 2A. As illustrated in FIG. 2B, the disclosed examples can include a vehicle 200 including in its body a system 100 with a first image capture device 122 positioned in the vicinity of the rearview mirror and/or near the driver of vehicle 200, a second image capture device 124 positioned on or in a bumper region (e.g., one of bumper regions 210) of vehicle 200, and a processing unit 110.

As illustrated in FIG. 2C, image capture devices 122 and 124 may both be positioned in the vicinity of the rearview mirror and/or near the driver of vehicle 200. Additionally, while two image capture devices 122 and 124 are shown in FIGS. 2B and 2C, it should be understood that other embodiments may include more than two image capture devices. For example, in the embodiment shown in FIG. 2D, first, second, and third image capture devices 122, 124, and 126, are included in the system 100 of vehicle 200.

As shown in FIG. 2D, image capture devices 122, 124, and 126 may be positioned in the vicinity of the rearview mirror and/or near the driver seat of vehicle 200. The disclosed examples are not limited to any particular number and configuration of the image capture devices, and the image capture devices may be positioned in any appropriate location within and/or on vehicle 200.

It is also to be understood that disclosed embodiments are not limited to a particular type of vehicle 200 and may be applicable to all types of vehicles including automobiles, trucks, trailers, motorcycles, bicycles, self-balancing transport devices and other types of vehicles.

The first image capture device 122 can include any suitable type of image capture device. Image capture device 122 can include an optical axis. In one instance, the image capture device 122 can include an Aptina M9V024 WVGA sensor with a global shutter. In another example, a rolling shutter sensor can be used. Image acquisition unit 120, and any image capture device which is implemented as part of the image acquisition unit 120, can have any desired image resolution. For example, image capture device 122 can provide a resolution of 1280×960 pixels and can include a rolling shutter.

Image acquisition unit 120, and any image capture device which is implemented as part of the image acquisition unit 120, can include various optical elements. In some embodiments one or more lenses can be included, for example, to provide a desired focal length and field of view for the image acquisition unit 120, and for any image capture device which is implemented as part of the image acquisition unit 120. In some examples, an image capture device which is implemented as part of the image acquisition unit 120 can include or be associated with any optical elements, such as a 6 mm lens or a 12 mm lens, for example. In some examples, image capture device 122 can be configured to capture images having a desired (and known) field-of-view (FOV).

The first image capture device 122 may have a scan rate associated with acquisition of each of the first series of image scan lines. The scan rate may refer to a rate at which an image sensor can acquire image data associated with each pixel included in a particular scan line.

FIG. 2E is a diagrammatic representation of vehicle control systems, according to examples of the presently disclosed subject matter. As indicated in FIG. 2E, vehicle 200 can include throttling system 220, braking system 230, and steering system 240. System 100 can provide inputs (e.g., control signals) to one or more of throttling system 220, braking system 230, and steering system 240 over one or more data links (e.g., any wired and/or wireless link or links for transmitting data). For example, based on analysis of images acquired by image capture devices 122, 124, and/or 126, system 100 can provide control signals to one or more of throttling system 220, braking system 230, and steering system 240 to navigate vehicle 200 (e.g., by causing an acceleration, a turn, a lane shift, etc.). Further, system 100 can receive inputs from one or more of throttling system 220, braking system 230, and steering system 240 indicating operating conditions of vehicle 200 (e.g., speed, whether vehicle 200 is braking and/or turning, etc.).

As shown in FIG. 3, vehicle 200 may also include a user interface 170 for interacting with a driver or a passenger of vehicle 200. For example, user interface 170 in a vehicle application may include a touch screen 320, knobs 330, buttons 340, and a microphone 350. A driver or passenger of vehicle 200 may also use handles (e.g., located on or near the steering column of vehicle 200 including, for example, turn signal handles), buttons (e.g., located on the steering wheel of vehicle 200), and the like, to interact with system 100. In some embodiments, microphone 350 may be positioned adjacent to a rearview mirror 310. Similarly, in some embodiments, image capture device 122 may be located near rearview mirror 310. In some embodiments, user interface 170 may also include one or more speakers 360 (e.g., speakers of a vehicle audio system). For example, system 100 may provide various notifications (e.g., alerts) via speakers 360.

As will be appreciated by a person skilled in the art having the benefit of this disclosure, numerous variations and/or modifications may be made to the foregoing disclosed embodiments. For example, not all components are essential for the operation of system 100. Further, any component may be located in any appropriate part of system 100 and the components may be rearranged into a variety of configurations while providing the functionality of the disclosed embodiments. Therefore, the foregoing configurations are examples and, regardless of the configurations discussed above, system 100 can provide a wide range of functionality to analyze the surroundings of vehicle 200 and, in response to this analysis, navigate and/or otherwise control and/or operate vehicle 200. Navigation, control, and/or operation of vehicle 200 may include enabling and/or disabling (directly or via intermediary controllers, such as the controllers mentioned above) various features, components, devices, modes, systems, and/or subsystems associated with vehicle 200. Navigation, control, and/or operation may alternately or additionally include interaction with a user, driver, passenger, passerby, and/or other vehicle or user, which may be located inside or outside vehicle 200, for example by providing visual, audio, haptic, and/or other sensory alerts and/or indications.

As discussed below in further detail and consistent with various disclosed embodiments, system 100 may provide a variety of features related to autonomous driving, semi-autonomous driving and/or driver assist technology. For example, system 100 may analyze image data, position data (e.g., GPS location information), map data, speed data, and/or data from sensors included in vehicle 200. System 100 may collect the data for analysis from, for example, image acquisition unit 120, position sensor 130, and other sensors. Further, system 100 may analyze the collected data to determine whether or not vehicle 200 should take a certain action, and then automatically take the determined action without human intervention. It would be appreciated that in some cases, the actions taken automatically by the vehicle are under human supervision, and the ability of the human to intervene adjust abort or override the machine action is enabled under certain circumstances or at all times. For example, when vehicle 200 navigates without human intervention, system 100 may automatically control the braking, acceleration, and/or steering of vehicle 200 (e.g., by sending control signals to one or more of throttling system 220, braking system 230, and steering system 240). Further, system 100 may analyze the collected data and issue warnings, indications, recommendations, alerts, or instructions to a driver, passenger, user, or other person inside or outside of the vehicle (or to other vehicles) based on the analysis of the collected data. Additional details regarding the various embodiments that are provided by system 100 are provided below.

A processing circuit may include multiple configurable units. Configurable units may include processors, address generators, counters, and other logic and/or memory units.

The configurable units may be configured to support different jobs, different tasks, different execute and suspend-update-resume sequences, and the like.

A configuration may be executed during a cyclic suspend-update-resume sequence in which an execution is suspended (suspend), the configuration takes place (update), and then the execution resumes (resume).

The processing circuit may execute multiple execute and suspend-update-resume sequences. Each execute and suspend-update-resume sequence may involve a cyclic suspend-update-resume sequence. Different execute and suspend-update-resume sequences may have different parameters (such as cycle length and delay). At least some of the execute and suspend-update-resume sequences may not be mutually synchronized.

There is a growing need to schedule cyclic suspend-update-resume sequences of different execute and suspend-update-resume sequences in an efficient manner.

There may be provide a method, a system, and a non-transitory computer readable medium that schedules, in an efficient manner, cyclic suspend-update-resume sequences of different execute and suspend-update-resume sequences.

FIG. 4 illustrates method 400.

Method 400 may start by step 402 of monitoring (during a monitoring period), and by multiple coroutines, a progress of multiple suspend-update-resume sequences that are executed by the processing circuit. One coroutine may be allocated per a suspend-update-resume sequence. At least some of the multiple suspend-update-resume sequences are not mutually synchronized and may partially overlap. If at one or more points of time different two sequences are executed and at one or more other points of time only one if the sequence is executed—then the two sequences partially overlap.

A cyclic suspend-update-resume sequence includes suspending the execution of a instruction, performing on-the-fly updating, and resuming the execution of the (updated) instructions.

Each cyclic suspend-update-resume sequence has its cycle period. A cycle period of one sequence may equal to or may differ than a cycle period of another sequence.

The monitoring of a cyclic suspend-update-resume sequence may include counting a cycle period after a completion of a previous cyclic suspend-update-resume sequence, and then initiating a next cyclic suspend-update-resume sequence.

Step 402 may be followed by step 404 of determining, by a merged coroutine, timings of the multiple suspend-update-resume sequences of the multiple execute and suspend-update-resume sequences.

The merged subroutine is merged in the sense that it merges the timing constraints of the multiple coroutines and determines the timings of all multiple suspend-update-resume sequences.

Step 404 may be executed in an iterative manner. This is illustrated by steps 406 and 408.

Step 406 may include starting a calculation iteration.

Step 406 may be followed by step 408 of calculating a timing of a next suspend-update-resume sequence to be executed out of the multiple suspend-update-resume sequences. Step 408 may be followed by step 406.

Step 404 may be followed by step 410 of executing the multiple suspend-update-resume sequences according to the timings determined in step 404.

Step 408 may include calculating, for each suspend-update-resume sequence, a time difference between a timing of the calculating iteration and a next cycle of the suspend-update-resume sequence. The calculating can be executed in any manner.

Step 408 may include selecting a suspend-update-resume sequence that has a smallest time difference as the next suspend-resume sequence.

Step 408 may include subtracting the smallest time difference from each timing difference of the multiple suspend-update-resume sequences.

FIG. 5 is a timing diagram 500 that illustrates an execution of four execute and suspend-update-resume sequences.

FIG. 5 illustrates (from left to right) a first execution and suspend-update-resume sequence, a second execute and suspend-update-resume sequence, a third execute and suspend-update-resume sequence, and a fourth execute and suspend-update-resume sequence .

The first execute and suspend-update-resume sequence is executed during period of time 510 that is followed by a first cyclic suspend-update-resume sequence (“SUR”) 511, another execution of the first execute and suspend-update-resume sequence, and a second cyclic suspend-update-resume sequence. The cyclic suspend-update-resume sequence has a first cycle period.

The second execute and suspend-update-resume sequence is executed during period of time 520 that is followed by a second cyclic suspend-update-resume sequence 521, another execution of the second execute and suspend-update-resume sequence, and a second cyclic suspend-update-resume sequence. The cyclic suspend-update-resume sequence has a second cycle period.

The third execute and suspend-update-resume sequence is executed during period of time 530 that is followed by a third cyclic suspend-update-resume sequence 531, another execution of the third execute and suspend-update-resume sequence, and a second cyclic suspend-update-resume sequence. The cyclic suspend-update-resume sequence has a third cycle period.

The fourth execute and suspend-update-resume sequence that is executed during period of time 540 that is followed by a fourth cyclic suspend-update-resume sequence 541, another execution of the fourth execute and suspend-update-resume sequence, and a fourth cyclic suspend-update-resume sequence. The cyclic suspend-update-resume sequence has a fourth cycle period.

At least some of the cycle periods differ from each other. For example, a cycle period of the first execute and suspend-update-resume sequences differs from the cycle period of the third execute and suspend-update-resume sequence.

At least some of the execute and suspend-update-resume sequences may start at different delays. For example, the second and forth execute and suspend-update-resume sequences start at different delays from the beginning of the first and third execute and suspend-update-resume sequences.

Although FIG. 5 illustrates four execute and suspend-update-resume sequences, it is understood that any other number of execute and suspend-update-resume sequences and any other timing differences and/or cycle periods may be provided.

FIG. 6 illustrates a timing diagram 600 and also illustrates few calculation iterations performed by the merged coroutine.

The first execute and suspend-update-resume sequence starts at point of time 0, is executed (510) for 12 cycles, undergoes (at point of time 12) a first cyclic suspend-update-resume sequence 511, is executed again (starting at point of time 13) for 12 cycles, and undergoes (at point of time 25) a second cyclic suspend-update-resume sequence 511. The first cycle period is thirteen units in duration.

The second execute and suspend-update-resume sequence starts at point of time 2, is executed (520) for 12 cycles, undergoes (at point of time 14) a first cyclic suspend-update-resume sequence 521, is executed again (starting at point of time 15) for 12 cycles, and undergoes (at point of time 27) a second cyclic suspend-update-resume sequence 521. The second cycle period is thirteen units in duration.

The third execute and suspend-update-resume sequence starts at point of time 0, is executed (530) for 15 cycles, undergoes (at point of time 15) a first cyclic suspend-update-resume sequence 531, is executed again (starting at point of time 16) for 15 cycles, and undergoes (at point of time 31) a second cyclic suspend-update-resume sequence 531. The third cycle period is sixteen units in duration.

The fourth execute and suspend-update-resume sequence starts at point of time 5, is executed (540) for 15 cycles, undergoes (at point of time 19) a first cyclic suspend-update-resume sequence 541, is executed again (starting at point of time 20) for 15 cycles, and undergoes (at point of time 34) a second cyclic suspend-update-resume sequence 541. The fourth cycle period is fifteen units in duration.

Table 602 illustrates the execution of step 408 of method 400. Table 602 includes the following columns: remaining time until the next cyclic suspend-update-resume sequence (“Next SUR”) of the first until fourth execute and suspend-update-resume sequences, a selected execute and suspend-update-resume sequence (“SELECTED”) that is the next execute and suspend-update-resume sequence to undergo a cyclic suspend-update-resume sequence, and an update value that reflects the remaining times at the next cycle.

FIG. 7 is an example of pseudocode 700 that schedules cyclic suspend-update-resume sequences of three execute and suspend-update-resume sequences that are monitored by three coroutines iter1, iter2, and iter3. The scheduling is performed by a merged coroutine merge_iterators (&iter3, iter1, iter2).

The execute and suspend-update-resume sequences are stopped, and cyclic suspend-update-resume sequences are executed according to the timings determined by the merged coroutine.

FIG. 8 is an example of pseudocode 800 of a merged coroutine.

The multiple execute and suspend-update-resume sequences may be used for scanning a multi-dimensional array. Each execute and suspend-update-resume sequence may be used for scanning a dedicated dimension. The multiple execute and suspend-update-resume sequences may be used for cases in which independent execution of execute and suspend-update-resume sequences is required.

FIG. 9 is an example of a four dimensional array and memory entries that stores parts of the four-dimensional array.

The four-dimensional (4D) array may include multiple three-dimensional (3D) arrays 900(1)-900(K), where each of the 3D arrays is associated with a unique value of the fourth dimension. K being an integer that may exceed two.

The multiple 3D arrays may be stored in different locations in memory 902(1)-902(K), each memory location starting at a base address 904(1)-904(K).

The scanning of the 4D array may include performing an execution iteration for scanning current a 3D array, performing a cyclic suspend-update-resume sequence that updates the base address from the base address related to the current 3D array to the base address related to the next 3D array, and jumping to the execution of the next 3D array.

FIG. 10 illustrates an example of method 1000.

Method 1000 is for scanning an array of a first plurality (N1) of dimensions. N1 is an integer that exceeds two.

Method 1000 may start by step 1002 of scanning, by a group of counters of a processing circuit, a second plurality (N2) of the dimensions of the array.

N1 exceeds N2.

The scanning starts at a current base address and is associated with a current value of a combination of one or more current values of one or more additional dimensions of the array.

The one or more additional dimensions of the array do not belong to the N2 dimensions of the array.

For example, referring to the example of FIG. 9, there is a single additional dimension—the fourth dimension.

If there is more than one additional dimension, then step 1002 is executed for a certain combination of the current values.

For example, referring to the example of FIG. 9 and assuming that there are two additional dimensions, the fourth dimension (illustrated in FIG. 9) and fifth dimension (5D), method 1000 has to scan all five dimensions and this is done by repeating step 1004 for all combinations of the pair of 4D value and 5D value. For example, if there are K 4D values and J 5D values than step 1002 will be repeated for K×J times.

Step 1002 may be followed by step 1004 of suspending at least the group of counters, upon a completion of the scanning of the second plurality of the dimensions.

Step 1004 may be followed by step 1006 of updating the current base address to point to a base address that is associated with a next value of the combination and jumping to the scanning.

The jumping may be executed until the required dimensions are scanned.

Steps 1004, 1006, and the jumping to the scanning may be executed during a cyclic suspend-update-resume sequence.

The suspending and updating are triggered by a first coroutine that is configured to track a progress of the scanning of the second plurality of the dimensions.

FIG. 11 is an example of pseudocode 1100 for scanning a multiple dimensional array.

Any of method describing steps may include more steps than those illustrated in the figure, only the steps illustrated in the figure or substantially only the steps illustrate in the figure. The same applies to components of a device, processor or system and to instructions stored in any non-transitory computer readable storage medium.

The invention may also be implemented in a computer program for running on a computer system, at least including code portions for performing steps of a method according to the invention when run on a programmable apparatus, such as a computer system or enabling a programmable apparatus to perform functions of a device or system according to the invention. The computer program may cause the storage system to allocate disk drives to disk drive groups.

A computer program is a list of instructions such as a particular application program and/or an operating system. The computer program may for instance include one or more of: a subroutine, a function, a procedure, an object method, an object implementation, an executable application, an applet, a servlet, a source code, an object code, a shared library/dynamic load library and/or other sequence of instructions designed for execution on a computer system.

The computer program may be stored internally on a non-transitory computer readable medium. All or some of the computer program may be provided on computer readable media permanently, removably or remotely coupled to an information processing system. The computer readable media may include, for example and without limitation, any number of the following: magnetic storage media including disk and tape storage media; optical storage media such as compact disk media (e.g., CD-ROM, CD-R, etc.) and digital video disk storage media; nonvolatile memory storage media including semiconductor-based memory units such as flash memory, EEPROM, EPROM, ROM; ferromagnetic digital memories; MRAM; volatile storage media including registers, buffers or caches, main memory, RAM, etc.

A computer process typically includes an executing (running) program or portion of a program, current program values and state information, and the resources used by the operating system to manage the execution of the process. An operating system (OS) is the software that manages the sharing of the resources of a computer and provides programmers with an interface used to access those resources. An operating system processes system data and user input, and responds by allocating and managing tasks and internal system resources as a service to users and programs of the system.

The computer system may for instance include at least one processing unit, associated memory and a number of input/output (I/O) devices. When executing the computer program, the computer system processes information according to the computer program and produces resultant output information via I/O devices.

In the foregoing specification, the invention has been described with reference to specific examples of embodiments of the invention. It will, however, be evident that various modifications and changes may be made therein without departing from the broader spirit and scope of the invention as set forth in the appended claims.

Moreover, the terms “front,” “back,” “top,” “bottom,” “over,” “under” and the like in the description and in the claims, if any, are used for descriptive purposes and not necessarily for describing permanent relative positions. It is understood that the terms so used are interchangeable under appropriate circumstances such that the embodiments of the invention described herein are, for example, capable of operation in other orientations than those illustrated or otherwise described herein.

The connections as discussed herein may be any type of connection suitable to transfer signals from or to the respective nodes, units or devices, for example via intermediate devices. Accordingly, unless implied or stated otherwise, the connections may for example be direct connections or indirect connections. The connections may be illustrated or described in reference to being a single connection, a plurality of connections, unidirectional connections, or bidirectional connections. However, different embodiments may vary the implementation of the connections. For example, separate unidirectional connections may be used rather than bidirectional connections and vice versa. Also, plurality of connections may be replaced with a single connection that transfers multiple signals serially or in a time multiplexed manner. Likewise, single connections carrying multiple signals may be separated out into various different connections carrying subsets of these signals. Therefore, many options exist for transferring signals.

Although specific conductivity types or polarity of potentials have been described in the examples, it will be appreciated that conductivity types and polarities of potentials may be reversed.

Each signal described herein may be designed as positive or negative logic. In the case of a negative logic signal, the signal is active low where the logically true state corresponds to a logic level zero. In the case of a positive logic signal, the signal is active high where the logically true state corresponds to a logic level one. Note that any of the signals described herein may be designed as either negative or positive logic signals. Therefore, in alternate embodiments, those signals described as positive logic signals may be implemented as negative logic signals, and those signals described as negative logic signals may be implemented as positive logic signals.

Furthermore, the terms “assert” or “set” and “negate” (or “deassert” or “clear”) are used herein when referring to the rendering of a signal, status bit, or similar apparatus into its logically true or logically false state, respectively. If the logically true state is a logic level one, the logically false state is a logic level zero. And if the logically true state is a logic level zero, the logically false state is a logic level one.

Those skilled in the art will recognize that the boundaries between logic blocks are merely illustrative and that alternative embodiments may merge logic blocks or circuit elements or impose an alternate decomposition of functionality upon various logic blocks or circuit elements. Thus, it is to be understood that the architectures depicted herein are merely exemplary, and that in fact many other architectures may be implemented which achieve the same functionality.

Any arrangement of components to achieve the same functionality is effectively “associated” such that the desired functionality is achieved. Hence, any two components herein combined to achieve a particular functionality may be seen as “associated with” each other such that the desired functionality is achieved, irrespective of architectures or intermedial components. Likewise, any two components so associated can also be viewed as being “operably connected,” or “operably coupled,” to each other to achieve the desired functionality.

Furthermore, those skilled in the art will recognize that boundaries between the above described operations merely illustrative. The multiple operations may be combined into a single operation, a single operation may be distributed in additional operations and operations may be executed at least partially overlapping in time. Moreover, alternative embodiments may include multiple instances of a particular operation, and the order of operations may be altered in various other embodiments.

Also for example, in one embodiment, the illustrated examples may be implemented as circuitry located on a single integrated circuit or within a same device. Alternatively, the examples may be implemented as any number of separate integrated circuits or separate devices interconnected with each other in a suitable manner.

Also for example, the examples, or portions thereof, may implemented as soft or code representations of physical circuitry or of logical representations convertible into physical circuitry, such as in a hardware description language of any appropriate type.

Also, the invention is not limited to physical devices or units implemented in non-programmable hardware but can also be applied in programmable devices or units able to perform the desired device functions by operating in accordance with suitable program code, such as mainframes, minicomputers, servers, workstations, personal computers, notepads, personal digital assistants, electronic games, automotive and other embedded systems, cell phones and various other wireless devices, commonly denoted in this application as ‘computer systems’.

However, other modifications, variations and alternatives are also possible. The specifications and drawings are, accordingly, to be regarded in an illustrative rather than in a restrictive sense.

In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word ‘comprising’ does not exclude the presence of other elements or steps then those listed in a claim. Furthermore, the terms “a” or “an,” as used herein, are defined as one or more than one. Also, the use of introductory phrases such as “at least one” and “one or more” in the claims should not be construed to imply that the introduction of another claim element by the indefinite articles “a” or “an” limits any particular claim containing such introduced claim element to inventions containing only one such element, even when the same claim includes the introductory phrases “one or more” or “at least one” and indefinite articles such as “a” or “an.” The same holds true for the use of definite articles. Unless stated otherwise, terms such as “first” and “second” are used to arbitrarily distinguish between the elements such terms describe. Thus, these terms are not necessarily intended to indicate temporal or other prioritization of such elements. The mere fact that certain measures are recited in mutually different claims does not indicate that a combination of these measures cannot be used to advantage.

While certain features of the invention have been illustrated and described herein, many modifications, substitutions, changes, and equivalents will now occur to those of ordinary skill in the art. It is, therefore, to be understood that the appended claims are intended to cover all such modifications and changes as fall within the true spirit of the invention. 

What is claimed is:
 1. A method for on-the fly updating of a processing circuit, the method comprising: monitoring, by multiple coroutines and during a monitoring period, a progress of multiple suspend-update-resume sequences executed by the processing circuit, wherein at least some of the multiple execute and suspend-update-resume sequences partially overlap and are not mutually synchronized, and wherein each suspend-update-resume sequence comprises on-the-fly updates; and determining, by a merged coroutine, timings of the multiple suspend-update-resume sequences, wherein the determining comprises performing multiple calculation iterations, wherein a calculation iteration of the multiple calculation iterations comprises calculating, in an iterative manner, a timing of a next suspend-update-resume sequence to be executed out of the multiple suspend-update-resume sequences, and wherein the calculating is responsive to timing offsets between different suspend-update-resume sequences.
 2. The method according to claim 1, wherein the multiple suspend-update-resume sequences are cyclic suspend-update-resume sequences, and each has a cycle period.
 3. The method according to claim 2, wherein the calculating is also responsive to cyclic periods of the multiple cyclic suspend-update-resume sequences.
 4. The method according to claim 2, wherein each calculating iteration comprises calculating, for each suspend-update-resume sequence, a time difference between a timing of the calculating iteration and a next cycle of the suspend-update-resume sequence.
 5. The method according to claim 2, wherein each calculating iteration comprises selecting a suspend-update-resume sequence that has a smallest time difference as the next suspend-resume sequence.
 6. The method according to claim 2, wherein each calculating iteration comprising subtracting the smallest time difference from each timing difference of the multiple suspend-update-resume sequences.
 7. The method according to claim 1, comprising executing the multiple suspend-update-resume sequences according to the timings.
 8. The method according to claim 1, comprising repeating the monitoring and the determining for multiple monitoring periods.
 9. A non-transitory computer readable medium that stores instructions, which when executed by a machine, causes the machine to perform operations comprising: monitoring, by multiple coroutines and during a monitoring period, a progress of multiple suspend-update-resume sequences executed by the processing circuit, wherein at least some of the multiple execute and suspend-update-resume sequences partially overlap and are not mutually synchronized, and wherein each suspend-update-resume sequence comprises on-the-fly updates; and determining, by a merged coroutine, timings of the multiple suspend-update-resume sequences, wherein the determining comprises performing multiple calculation iterations, wherein a calculation iteration of the multiple calculation iterations comprises calculating, in an iterative manner, a timing of a next suspend-update-resume sequence to be executed out of the multiple suspend-update-resume sequences, and wherein the calculating is responsive to timing offsets between different suspend-update-resume sequences.
 10. The non-transitory computer readable medium according to claim 9, wherein the multiple suspend-update-resume sequences are cyclic suspend-update-resume sequences, and each has a cycle period.
 11. The non-transitory computer readable medium according to claim 10, wherein the calculating is also responsive to cyclic periods of the multiple cyclic suspend-update-resume sequences.
 12. The non-transitory computer readable medium according to claim 10, wherein each calculating iteration comprises calculating, for each suspend-update-resume sequence, a time difference between a timing of the calculating iteration and a next cycle of the suspend-update-resume sequence.
 13. The non-transitory computer readable medium according to claim 12, wherein each calculating iteration comprises selecting a suspend-update-resume sequence that has a smallest time difference as the next suspend-resume sequence.
 14. The non-transitory computer readable medium according to claim 13, wherein each calculating iteration comprising subtracting the smallest time difference from each timing difference of the multiple suspend-update-resume sequences.
 15. The non-transitory computer readable medium according to claim 9, wherein the operations comprise executing the multiple suspend-update-resume sequences according to the timings.
 16. The non-transitory computer readable medium according to claim 9, wherein the operations comprise repeating the monitoring and the determining for multiple monitoring periods.
 17. A processing circuit that is configured to: monitor, by multiple coroutines and during a monitoring period, a progress of multiple suspend-update-resume sequences executed by the processing circuit, wherein at least some of the multiple execute and suspend-update-resume sequences partially overlap and are not mutually synchronized, wherein each suspend-update-resume sequence comprises on-the-fly updates; and determine, by a merged coroutine, timings of the multiple suspend-update-resume sequences, wherein the determining comprises performing multiple calculation iterations, wherein a calculation iteration of the multiple calculation iterations comprises calculating, in an iterative manner, a timing of a next suspend-update-resume sequence to be executed out of the multiple suspend-update-resume sequences, and wherein the calculating is responsive to timing offsets between different suspend-update-resume sequences.
 18. A method for scanning an array of a first plurality (N1) of dimensions, the method comprising: scanning, by a group of counters of a processing circuit, a second plurality (N2) of the dimensions of the array, wherein N1 exceeds N2, wherein the scanning starts at a current base address and is associated with a current value of a combination of one or more current values of one or more additional dimensions of the array, wherein the one or more additional dimensions of the array do not belong to the N2 dimensions of the array; suspending at least the group of counters, upon a completion of the scanning of the second plurality of the dimensions; and updating the current base address to point to a base address that is associated with a next value of the combination and jumping to the scanning.
 19. The method according to claim 18, wherein the suspending and updating are triggered by a first coroutine that is configured to track a progress of the scanning of the second plurality of the dimensions.
 20. The method according to claim 18, wherein there is only one additional dimension and wherein the combination of the one or more current values of the additional dimension of the array is a value associated with the additional dimension.
 21. The method according to claim 18, wherein there are two or more additional dimensions and wherein the combination of the one or more current values of the two or more additional dimensions of the array is a combination of current values of each one of the two or more additional dimensions.
 22. A non-transitory computer readable medium that stores instructions, which when executed by a machine, causes the machine to perform operations comprising: scanning, by a group of counters of a processing circuit, a second plurality (N2) of the dimensions of the array, wherein the array has a first plurality (N1) of dimensions, wherein N1 exceeds N2, wherein the scanning starts at a current base address and is associated with a current value of a combination of one or more current values of one or more additional dimensions of the array, wherein the one or more additional dimensions of the array do not belong to the N2 dimensions of the array; suspending at least the group of counters, upon a completion of the scanning of the second plurality of the dimensions; and updating the current base address to point to a base address that is associated with a next value of the combination and jumping to the scanning.
 23. A method comprising: scanning, by a group of counters of a processing circuit, a second plurality (N2) of the dimensions of the array, wherein the array has a first plurality (N1) of dimensions, wherein N1 exceeds N2, wherein the scanning starts at a current base address and is associated with a current value of a combination of one or more current values of one or more additional dimensions of the array, wherein the one or more additional dimensions of the array do not belong to the N2 dimensions of the array; suspending at least the group of counters, upon a completion of the scanning of the second plurality of the dimensions; and updating the current base address to point to a base address that is associated with a next value of the combination and jumping to the scanning. 